The Eccentric Connectivity Index of Unicyclic Graphs

نویسندگان

  • Libing Zhang
  • Hongbo Hua
چکیده

If G is a connected graph with vertex set V (G), then the eccentric connectivity index of G, denoted by ξc(G), is defined as ∑ v∈V (G) deg(v)ec(v), where deg(v) is the degree of a vertex v and ec(v) is its eccentricity. Morgan et al. [5] investigated the eccentric connectivity index of trees. In this paper, we investigate the eccentric connectivity index of unicyclic graphs. Upper bound is obtained for ξc(G) of unicyclic graphs and the corresponding extremal graph is characterized as well. Mathematics Subject Classification: 05C35; 05C12; 05C90

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Eccentric Connectivity Index of Unicyclic Graphs

In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.

متن کامل

Eccentric Connectivity Index: Extremal Graphs and Values

Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...

متن کامل

Eccentric Connectivity Index of Some Dendrimer Graphs

The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.

متن کامل

Some topological indices of graphs and some inequalities

Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.

متن کامل

Eccentric Connectivity Index

The eccentric connectivity index ξ is a novel distance–based molecular structure descriptor that was recently used for mathematical modeling of biological activities of diverse nature. It is defined as ξ(G) = ∑ v∈V (G) deg(v) · ε(v) , where deg(v) and ε(v) denote the vertex degree and eccentricity of v , respectively. We survey some mathematical properties of this index and furthermore support ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010